翻訳と辞書
Words near each other
・ Proofing (baking technique)
・ Proofpoint
・ Proofpoint Systems, Inc
・ Proofpoint, Inc.
・ Proofreading
・ Proofreading (biology)
・ Proofs and Refutations
・ Proofs from THE BOOK
・ Proofs involving covariant derivatives
・ Proofs involving ordinary least squares
・ Proofs involving the addition of natural numbers
・ Proofs involving the Laplace–Beltrami operator
・ Proofs involving the Moore–Penrose pseudoinverse
・ Proofs of convergence of random variables
・ Proofs of elementary ring properties
Proofs of Fermat's little theorem
・ Proofs of Fermat's theorem on sums of two squares
・ Proofs of quadratic reciprocity
・ Proofs of trigonometric identities
・ Proofs related to chi-squared distribution
・ Prooftext
・ Proomphe
・ Proopiomelanocortin
・ Prooppia
・ Proornis
・ Proost (company)
・ Proozaena
・ PROP
・ Prop
・ ProP (transporter)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Proofs of Fermat's little theorem : ウィキペディア英語版
Proofs of Fermat's little theorem

This article collects together a variety of proofs of Fermat's little theorem, which states that
:a^p \equiv a \pmod p \,\!
for every prime number ''p'' and every integer ''a'' (see modular arithmetic).
==Simplifications==
Some of the proofs of Fermat's little theorem given below depend on two simplifications.
The first is that we may assume that ''a'' is in the range 0 ≤ ''a'' ≤ ''p'' − 1. This is a simple consequence of the laws of modular arithmetic; we are simply saying that we may first reduce ''a'' modulo ''p''.
Secondly, it suffices to prove that
:a^ \equiv 1 \pmod p \quad \quad (X)
for ''a'' in the range 1 ≤ ''a'' ≤ ''p'' − 1. Indeed, if (X) holds for such ''a'', multiplying both sides by ''a'' yields the original form of the theorem,
:a^p \equiv a \pmod p \,\!
On the other hand, if ''a'' equals zero, the theorem holds trivially.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Proofs of Fermat's little theorem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.